Membrane computing : Current results and future problemsBERNARDINI, Francesco; GHEORGHE, Marian; KRASNOGOR, Natalio et al.Lecture notes in computer science. 2005, pp 49-53, issn 0302-9743, isbn 3-540-26179-6, 5 p.Conference Paper

Introduction : If CiE did not exist, it would be necessary to invent itCOOPER, S. Barry.Lecture notes in computer science. 2005, pp 1-7, issn 0302-9743, isbn 3-540-26179-6, 7 p.Conference Paper

Finding, counting and listing all triangles in large graphs, an experimental studySCHANK, Thomas; WAGNER, Dorothea.Lecture notes in computer science. 2005, pp 606-609, issn 0302-9743, isbn 3-540-25920-1, 4 p.Conference Paper

Algorithms - ESA 2004 (Bergen, 14-17 September 2004)Albers, Susanne; Radzik, Tomasz.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23025-4, XVIII, 834 p, isbn 3-540-23025-4Conference Proceedings

Approximation of rectangle stabbing and interval stabbing problemsKOVALEVA, Sofia; SPIEKSMA, Frits C. R.Lecture notes in computer science. 2004, pp 426-435, issn 0302-9743, isbn 3-540-23025-4, 10 p.Conference Paper

Algorithmic aspects in information and management (Second international conference, AAIM 2006, Hong Kong, China, June 20-22, 2006)Cheng, Siu-Wing; Poon, Chung Keung.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-35157-4, 1Vol, XI-394 p, isbn 3-540-35157-4Conference Proceedings

Further reflections on a theory for basic algorithmsBORODIN, Allan.Lecture notes in computer science. 2006, pp 1-9, issn 0302-9743, isbn 3-540-35157-4, 1Vol, 9 p.Conference Paper

New computational paradigms (Amsterdam, 8-12 June 2005)Cooper, S. Barry; Löwe, Benedikt; Torenvliet, Leen et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26179-6, XVII, 574 p, isbn 3-540-26179-6Conference Proceedings

Efficient algorithms for k maximum sumsBENGTSSON, Fredrik; JINGSEN CHEN.Lecture notes in computer science. 2004, pp 137-148, issn 0302-9743, isbn 3-540-24131-0, 12 p.Conference Paper

Algorithms theorye (Humlebaek, 8-10 July 2004)Hagerup, Torben; Katajainen, Jyrki.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22339-8, XI, 503 p, isbn 3-540-22339-8Conference Proceedings

On the problems of definability in the enumeration degreesKALIMULLIN, Iskander Sh.Lecture notes in computer science. 2005, pp 221-222, issn 0302-9743, isbn 3-540-26179-6, 2 p.Conference Paper

Probabilités et informatique = Probabilities and information technologyPLATEAU, B.Le Courrier du C.N.R.S. 1993, Num 80, issn 0153-985X, p. 60Article

Combinatorial models of gene assemblyHARJU, Tero.Lecture notes in computer science. 2005, pp 188-195, issn 0302-9743, isbn 3-540-26179-6, 8 p.Conference Paper

Experimental algorithmics : from algorithm design to robust and efficient software (Dagstuhl, September 2000)Fleischer, Rudolf; Moret, Bernard; Meineche Schmidt, Erik et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-00346-0, XVII, 278 p, isbn 3-540-00346-0Conference Proceedings

The set of minimal braids is Co-NP-completePATERSON, M. S; RAZBOROV, A. A.Journal of algorithms (Print). 1991, Vol 12, Num 3, pp 393-408, issn 0196-6774Article

An incremental computation of convex hull of planar line intersectionsBOREDDY, J.Pattern recognition letters. 1990, Vol 11, Num 8, pp 541-543, issn 0167-8655Article

A tight lower bound for the complexity of path-planning for a discO'DUNLAING, C.Information processing letters. 1988, Vol 28, Num 4, pp 165-170, issn 0020-0190Article

A note on minimal visibility graphsXIAOJUN SHEN; QING HU.Information processing letters. 1993, Vol 46, Num 2, issn 0020-0190, p. 101Article

Algorithms - ESA 2005 (13th annual European sympoisum, Palma de Mallorca, Sapin, October 3-6, 2005, proceedings)Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-29118-0, 1Vol, XVIII, 901 p, isbn 3-540-29118-0Conference Proceedings

The small grzegorczyk classes and the typed λ-calculusKRISTIANSEN, Lars; BARRA, Mathias.Lecture notes in computer science. 2005, pp 252-262, issn 0302-9743, isbn 3-540-26179-6, 11 p.Conference Paper

Time-optimal short-circuit evaluation of Boolean expressionsSASSA, M; NAKATA, I.Information processing letters. 1988, Vol 29, Num 1, pp 43-51, issn 0020-0190Article

Comments on: the computation of the convex hull of a simple polygon in linear timeELGINDY, H.Computers and artificial intelligence. 1987, Vol 6, Num 5, pp 437-440, issn 0232-0274Article

SAGA 2003 : stochastic algorithms : foundations and applications (Hatfield, 22-23 September 2003)Albrecht, Andreas; Steinhöfel, Kathleen.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20103-3, VIII, 166 p, isbn 3-540-20103-3Conference Proceedings

An efficient decision procedure for the theory of fixed-sized bit-vectorsCYRLUK, D; MÖLLER, O; RUESS, H et al.Lecture notes in computer science. 1997, pp 60-71, issn 0302-9743, isbn 3-540-63166-6Conference Paper

A logical approach to abstract algebraCOQUAND, Thierry.Lecture notes in computer science. 2005, pp 86-95, issn 0302-9743, isbn 3-540-26179-6, 10 p.Conference Paper